TSTP Solution File: ITP006^5 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : ITP006^5 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.6nIpDbyFWy true

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 05:20:52 EDT 2023

% Result   : Theorem 88.72s 12.07s
% Output   : Refutation 88.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   15 (   1 unt;   7 typ;   0 def)
%            Number of atoms       :   57 (   0 equ;   1 cnn)
%            Maximal formula atoms :   14 (   7 avg)
%            Number of connectives :  234 (   4   ~;   0   |;   0   &; 182   @)
%                                         (   2 <=>;  31  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (  15 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   4 con; 0-2 aty)
%                                         (  15  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   36 (  15   ^;  21   !;   0   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
thf(del_type,type,
    del: $tType ).

thf(c_2EquantHeuristics_2EGUESS__FORALL__POINT_type,type,
    c_2EquantHeuristics_2EGUESS__FORALL__POINT: del > del > $i ).

thf(mem_type,type,
    mem: $i > del > $o ).

thf(p_type,type,
    p: $i > $o ).

thf(ap_type,type,
    ap: $i > $i > $i ).

thf(arr_type,type,
    arr: del > del > del ).

thf(bool_type,type,
    bool: del ).

thf(ap_tp,axiom,
    ! [A: del,B: del,F: $i] :
      ( ( mem @ F @ ( arr @ A @ B ) )
     => ! [X: $i] :
          ( ( mem @ X @ A )
         => ( mem @ ( ap @ F @ X ) @ B ) ) ) ).

thf(zip_derived_cl3,plain,
    ( !!
    @ ^ [Y0: del] :
        ( !!
        @ ^ [Y1: del] :
            ( !!
            @ ^ [Y2: $i] :
                ( ( mem @ Y2 @ ( arr @ Y0 @ Y1 ) )
               => ( !!
                  @ ^ [Y3: $i] :
                      ( ( mem @ Y3 @ Y0 )
                     => ( mem @ ( ap @ Y2 @ Y3 ) @ Y1 ) ) ) ) ) ) ),
    inference(cnf,[status(esa)],[ap_tp]) ).

thf(conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT,conjecture,
    ! [A_27a: del,A_27b: del,V0i: $i] :
      ( ( mem @ V0i @ ( arr @ A_27b @ A_27a ) )
     => ! [V1P: $i] :
          ( ( mem @ V1P @ ( arr @ A_27a @ bool ) )
         => ! [V2Q: $i] :
              ( ( mem @ V2Q @ ( arr @ A_27a @ bool ) )
             => ( ! [V3x: $i] :
                    ( ( mem @ V3x @ A_27a )
                   => ( ( p @ ( ap @ V2Q @ V3x ) )
                     => ( p @ ( ap @ V1P @ V3x ) ) ) )
               => ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27b @ A_27a ) @ V0i ) @ V1P ) )
                 => ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27b @ A_27a ) @ V0i ) @ V2Q ) ) ) ) ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [A_27a: del,A_27b: del,V0i: $i] :
        ( ( mem @ V0i @ ( arr @ A_27b @ A_27a ) )
       => ! [V1P: $i] :
            ( ( mem @ V1P @ ( arr @ A_27a @ bool ) )
           => ! [V2Q: $i] :
                ( ( mem @ V2Q @ ( arr @ A_27a @ bool ) )
               => ( ! [V3x: $i] :
                      ( ( mem @ V3x @ A_27a )
                     => ( ( p @ ( ap @ V2Q @ V3x ) )
                       => ( p @ ( ap @ V1P @ V3x ) ) ) )
                 => ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27b @ A_27a ) @ V0i ) @ V1P ) )
                   => ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27b @ A_27a ) @ V0i ) @ V2Q ) ) ) ) ) ) ),
    inference('cnf.neg',[status(esa)],[conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT]) ).

thf(zip_derived_cl3783,plain,
    ~ ( !!
      @ ^ [Y0: del] :
          ( !!
          @ ^ [Y1: del] :
              ( !!
              @ ^ [Y2: $i] :
                  ( ( mem @ Y2 @ ( arr @ Y1 @ Y0 ) )
                 => ( !!
                    @ ^ [Y3: $i] :
                        ( ( mem @ Y3 @ ( arr @ Y0 @ bool ) )
                       => ( !!
                          @ ^ [Y4: $i] :
                              ( ( mem @ Y4 @ ( arr @ Y0 @ bool ) )
                             => ( ( !!
                                  @ ^ [Y5: $i] :
                                      ( ( mem @ Y5 @ Y0 )
                                     => ( ( p @ ( ap @ Y4 @ Y5 ) )
                                       => ( p @ ( ap @ Y3 @ Y5 ) ) ) ) )
                               => ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ Y1 @ Y0 ) @ Y2 ) @ Y3 ) )
                                 => ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ Y1 @ Y0 ) @ Y2 ) @ Y4 ) ) ) ) ) ) ) ) ) ) ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def,axiom,
    ! [A_27a: del,A_27b: del,V0i: $i] :
      ( ( mem @ V0i @ ( arr @ A_27a @ A_27b ) )
     => ! [V1P: $i] :
          ( ( mem @ V1P @ ( arr @ A_27b @ bool ) )
         => ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27a @ A_27b ) @ V0i ) @ V1P ) )
          <=> ! [V2fv: $i] :
                ( ( mem @ V2fv @ A_27a )
               => ~ ( p @ ( ap @ V1P @ ( ap @ V0i @ V2fv ) ) ) ) ) ) ) ).

thf(zip_derived_cl3740,plain,
    ( !!
    @ ^ [Y0: del] :
        ( !!
        @ ^ [Y1: del] :
            ( !!
            @ ^ [Y2: $i] :
                ( ( mem @ Y2 @ ( arr @ Y0 @ Y1 ) )
               => ( !!
                  @ ^ [Y3: $i] :
                      ( ( mem @ Y3 @ ( arr @ Y1 @ bool ) )
                     => ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ Y0 @ Y1 ) @ Y2 ) @ Y3 ) )
                      <=> ( !!
                          @ ^ [Y4: $i] :
                              ( ( mem @ Y4 @ Y0 )
                             => ( (~) @ ( p @ ( ap @ Y3 @ ( ap @ Y2 @ Y4 ) ) ) ) ) ) ) ) ) ) ) ) ),
    inference(cnf,[status(esa)],[ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def]) ).

thf(zip_derived_cl6999,plain,
    $false,
    inference(eprover,[status(thm)],[zip_derived_cl3,zip_derived_cl3783,zip_derived_cl3740]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : ITP006^5 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.00/0.14  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.6nIpDbyFWy true
% 0.13/0.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sun Aug 27 11:20:48 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Running portfolio for 300 s
% 0.13/0.35  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.35  % Number of cores: 8
% 0.13/0.35  % Python version: Python 3.6.8
% 0.22/0.36  % Running in HO mode
% 0.22/0.64  % Total configuration time : 828
% 0.22/0.64  % Estimated wc time : 1656
% 0.22/0.64  % Estimated cpu time (8 cpus) : 207.0
% 0.22/0.70  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.22/0.70  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.22/0.70  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.22/0.73  % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.22/0.73  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.22/0.73  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.22/0.74  % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.22/0.74  % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 4.25/1.19  % /export/starexec/sandbox2/solver/bin/lams/30_b.l.sh running for 90s
% 88.72/12.07  % Solved by lams/15_e_short1.sh.
% 88.72/12.07  % done 328 iterations in 11.307s
% 88.72/12.07  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 88.72/12.07  % SZS output start Refutation
% See solution above
% 88.72/12.07  
% 88.72/12.07  
% 88.72/12.07  % Terminating...
% 89.49/12.26  % Runner terminated.
% 89.49/12.27  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------